Finite Automata with Colored Accepting States and Their Unmixedness Problems

Some textbooks of formal languages and automata theory implicitly state the structural equality binary n-dimensional de Bruijn graph diagram minimum deterministic finite automaton which accepts regular language (0+1)*1(0+1)n-1. By introducing special whose accepting states are refined with two or more colors, we extend this fact to both k-ary versions. That is, prove that Brujin for colored (k-1)-tuple (0+1+…+k-1)*1(0+1+…+k-1)n-1,...,and(0+1+…+k-1)*(k-1)(0+1+…+k-1)n-1 isomorphic arbitrary k than equal 2. We also investigate properties themselves give computational complexity results on three decision problems concerning color unmixedness nondeterminisitic ones.